LOAD BALANCING ANGULAR ADAPTIVITY ON ENERGY DEPENDENT REACTOR PROBLEMS
نویسندگان
چکیده
This paper presents a novel parallel algorithm capable of solving problems with multiple energy groups, such as reactor core problems, using dependent angular hadaptivity coupled Dynamic Load Balancing (DLB). We use the C5G7 NEA benchmark an example our in-house code FETCH2 and compare runtimes Continuous Degrees Freedom (CDOFs) between independent adapting runs without DLB. Our results demonstrate 32% reduction in CDOFs 38% runtime favour adaptivity DLB when compared to adaptivity.
منابع مشابه
Load Balancing 2-Phased Geometrically Based Problems
A k-weighted graph is a directed graph where each vertex has k associated weights. Partitioning such a graph so that each weight is roughly evenly divided into each piece is useful for balancing a parallel task with k distinct components. Such a goal arises in crash simulation, in which there there are 2 components. We present a 2-weighted graph partitioning algorithm, based on the Ham Sandwich...
متن کاملStochastic Load Balancing and Related Problems
We study the problems of makespan minimization (load balancing), knapsack, and bin packing when the jobs have stochastic processing requirements or sizes. If the jobs are all Poisson, we present a two approximation for the first problem using Graham’s rule, and observe that polynomial time approximation schemes can be obtained for the last two problems. If the jobs are all exponential, we prese...
متن کاملPractical Dynamic Load Balancing for Irregular Problems
In this paper, we present a cohesive, practical load balancing framework that addresses many shortcomings of existing strategies. These techniques are portable to a broad range of prevalent architec-tures, including massively parallel machines such as the Cray T3D and Intel Paragon, shared memory systems such as the SGI Power Challenge, and networks of workstations. This scheme improves on earl...
متن کاملOn-line Load Balancing
The setup for our problem consists of n servers that must complete a set of tasks. Each task can be handled only by a subset of the servers, requires a diierent level of service, and once assigned can not be reassigned. We make the natural assumption that the level of service is known at arrival time, but that the duration of service is not. The on-line load balancing problem is to assign each ...
متن کاملLoad Balancing on the Internet
Introduction 1 Workload Characteristics of Internet Services 2 Web Applications 3 Streaming Applications 4 Taxonomy of Load-Balancing Strategies 4 Load Balancing in the Server, the Network, and the Client Sides 4 State-Blind versus State-Aware Load Balancing 5 Load Balancing at Different Network Layers 5 Server-Side Load Balancing 5 DNS-Based Load Balancing 5 Dispatcher-Based Load Balancing 7 S...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Epj Web of Conferences
سال: 2021
ISSN: ['2101-6275', '2100-014X']
DOI: https://doi.org/10.1051/epjconf/202124703025